Categorical attribute based centrality: E–I and G–F centrality

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Categorical attribute based centrality: E-I and G-F centrality

In a paper examining informal networks and organizational crisis, Krackhardt and Stern (1988) proposed a measure assessing the extent to which relations in a network were internal to a group as opposed to rokerage roles ategorical attributes external. They called their measure the E–I index. The measure is now in wide use and is implemented in standard network packages such as UCINET (Borgatti ...

متن کامل

Eigenvector-centrality - a node-centrality?

Networks of social relations can be represented by graphs and socioor adjacency-matrices and their structure can be analyzed using different concepts, one of them called centrality. We will provide a new formalization of a “node-centrality” which leads to some properties a measure of centrality has to satisfy. These properties allow to test given measures, for example measures based on degree, ...

متن کامل

Centrality-based Pathway Enrichment

Gene set enrichment analysis is broadly used in microarray data analysis [8, 5]. It aimes to find which biological functions are affected by a group of related genes behind the massive information. The most used methotology is finding these significant gene set from a 2 × 2 contingency table, usually by Fisher’s exact test or chi-square test. This kind of analysis is known as Over-represented A...

متن کامل

Centrality based Document Ranking

In this paper, we address the problem of ranking clinical documents using centrality based approach. We model the documents to be ranked as nodes in a graph and place edges between documents based on their similarity. Given a query, we compute similarity of the query with respect to every document in the graph. Based on these similarity values, documents are ranked for a given query. Initially,...

متن کامل

Network evolution based on centrality.

We study the evolution of networks when the creation and decay of links are based on the position of nodes in the network measured by their centrality. We show that the same network dynamics arise under various centrality measures, and solve analytically the network evolution. During the complete evolution, the network is characterized by nestedness: the neighborhood of a node is contained in t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Networks

سال: 2012

ISSN: 0378-8733

DOI: 10.1016/j.socnet.2012.06.002